Logical Concurrency Control from Sequential Proofs
نویسندگان
چکیده
منابع مشابه
Logical Concurrency Control from Sequential Proofs
We are interested in identifying and enforcing the isolation requirements of a concurrent program, i.e., concurrency control that ensures that the program meets its specification. The thesis of this paper is that this can be done systematically starting from a sequential proof, i.e., a proof of correctness of the program in the absence of concurrent interleavings. We illustrate our thesis by pr...
متن کاملExtracting Exact Time Bounds from Logical Proofs
Accurate evaluation of delays of combinatorial circuits is crucial in circuit verification and design. In this paper we present a logical approach to timing analysis which allows us to compute exact stabilization bounds while proving the correctness of the boolean behavior.
متن کاملConcurrency, Fairness and Logical Complexity
We consider a connection between fairness and 0 3 sets of functions made recently by Darondeau, Nolte, Priese and Yoccoz, and extend their work to cater for eeective asynchronous transition systems with concurrency structure represented by a Mazurkiewicz independency relation.
متن کاملJump from parallel to sequential proofs: exponentials
In previous works, by importing ideas from game semantics (notably Faggian-Maurel-Curien’s ludics nets), we defined a new class of multiplicative/additive polarized proof nets, called J-proof nets. The distinctive feature of J-proof nets with respect to other proof net syntaxes, is the possibility of representing proof nets which are partially sequentialized, by using jumps (that is, untyped ex...
متن کاملJump from Parallel to Sequential Proofs: Multiplicatives
We introduce a new class of multiplicative proof nets, J-proof nets, which are a typed version of Faggian and Maurel’s multiplicative L-nets. In J-proof nets, we can characterize nets with different degrees of sequentiality, by gradual insertion of sequentiality constraints. As a byproduct, we obtain a simple proof of the sequentialisation theorem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2011
ISSN: 1860-5974
DOI: 10.2168/lmcs-7(3:10)2011